Ordinal Arithmetic: A Case Study for Rippling in a Higher Order Domain
نویسندگان
چکیده
This paper reports a case study in the use of proof planning in the context of higher order syntax. Rippling is a heuristic for guiding rewriting steps in induction that has been used successfully in the proof planning inductive of proofs using first order representations. Ordinal arithmetic provides a natural set of higher order examples on which transfinite induction may be attempted using rippling. Previously Boyer-Moore style automation could not be applied to such domains. We demonstrate that a higher-order extension of the rippling heuristic is sufficient to plan such proofs automatically. Accordingly, ordinal arithmetic has been implemented in LambdaClam, a higher order proof planning system for induction, and standard undergraduate text book problems have been successfully planned with a simple extension to the standard machinery for higher order rippling and induction. We show the synthesis of a fixpoint for normal ordinal functions which demonstrates how our automation could be extended to produce more interesting results that the textbook examples tried so far.
منابع مشابه
Second-order Characterizable Cardinals and Ordinals Second-order Characterizable Cardinals and Ordinals
The notions of finite and infinite second-order characterizability of cardinal and ordinal numbers are developed. Several known results for the case of finite characterizability are extended to infinite characterizability, and investigations of the secondorder theory of ordinals lead to some observations about the Fraenkel-Carnap question for well-orders and about the relationship between ordin...
متن کاملTermination Orderings for Rippling
Rippling is a special type of rewriting developed for induct-ive theorem proving. Bundy et. al. have shown that rippling terminates by providing a well-founded order for the annotated rewrite rules used by rippling. Here, we simplify and generalize this order, thereby enlarging the class of rewrite rules that can be used. In addition, we extend the power of rippling by proposing new domain depe...
متن کاملConsiderations in design and use of scales in rehabilitative audiology.
Self-assessment questionnaires in rehabilitative audiology typically possess the measurement characteristics of scales based on forced-choice and rank-order. Data from these ordinal scales neither support arithmetic analysis nor arithmetic interpretation. However, powerful nonparametric statistics are available for application to data from ordinal level questionnaires. Thus, methodologic princi...
متن کاملProofs, Programs and Abstract Complexity
Axiom systems are ubiquitous in mathematical logic, one famous and well studied example being first order Peano arithmetic. Foundational questions asked about axiom systems comprise analysing their provable consequences, describing their class of provable recursive functions (i.e. for which programs can termination be proven from the axioms), and characterising their consistency strength. One b...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2001